package leetcode_easy;

public class problem_1 {
	public static void main(String[] args) {
		int[] nums ={2,7,11,15};
		int target = 9;
		int[] index = new int[2];
		index = twoSum(nums,9);
		for (int i = 0; i < index.length; i++) {
			System.out.println(index[i]);
		}
	}
	public static int[] twoSum(int[] nums, int target) {
		int[] index = new int[2];
		for (int i = 0; i < nums.length - 1; i++) {
			for (int j = i + 1; j < nums.length; j++) {
				if (nums[i] + nums[j] == target) {
					index[0] = i;
					index[1] = j;
				}
			}
		}
		return index;
        
    }
}
